Correcting Sorted Sequences in a Single Hop Radio Network

نویسنده

  • Marcin Kik
چکیده

By k-disturbed sequence we mean a sequence obtained from a sorted sequence by changing the values of at most k elements. We present an algorithm for single-hop radio networks that sorts a k-disturbed sequence of length n (where each station stores single key) in time 4n+ k · (⌈lg k⌉+⌈lg(n−k+1)⌉+6⌈lg k⌉)−2 with energetic cost 3·⌈ (⌈lg k⌉+1)(⌈lg k⌉+2) 2⌊n/k⌋ ⌉+ 4 · ⌈ ⌈lg k⌉ ⌊n/k⌋ ⌉+ 10. If (⌈lg k⌉+1)(⌈lg k⌉+2) 2 + ⌈lg k⌉ ≤ ⌊n/k⌋ then the energetic cost is bounded by 14.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Merging and Merge-Sort in a Single Hop Radio Network

We present two merging algorithms on a single-channel single-hop radio network without collision detection. The simpler of these algorithms merges two sorted sequences of length n in time 4n with energetic cost for each station ≈ lg n. The energetic cost of broadcasting is constant. This yields the mergesort for n elements in time 2n lg n, where the energetic cost for each station is

متن کامل

Ranking and Sorting in Unreliable Single Hop Radio Network

We propose simple and efficient sorting algorithm for unreliable single hop radio network. (In such network each listening station receives transmitted message with some probability p < 1.) We also propose a method of periodic transmission of a sorted sequence that allows for efficient and energetically safe ranking in this sequence.

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Analysis of Network Lifetime for Wireless Sensor Network

Wireless Sensor Network (WSN) consists of motes which are equipped with limited battery and requires energy management for enhanced Network Lifetime. In this paper we have adopted a deployment strategy which is performed over a region of interest (ROI) obtained from contour integration of one hop to other. The selection of motes depending on the type of application is also analyzed. The necessi...

متن کامل

Radio resource management scheme and outage analysis for network-assisted multi-hop D2D communications

In a cellular network it's very difficult to make spectrum resource more efficiently. Device-to-Device (D2D) technology enables new service opportunities, and provides high throughput and reliable communication while reducing the base station load. For better total performance, short-range D2D links and cellular links share the same radio resource and the management of interference becomes a cr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009